A Fast Compressive Channel Estimation with Modified Smoothed L0 Algorithm

نویسندگان

  • Guan Gui
  • Wei Peng
  • Qun Wan
  • Fumiyuki Adachi
چکیده

Broadband wireless channel is a time dispersive and becomes strongly frequency selective. In most cases, the channel is composed of a few dominant coefficients and a large part of coefficients is approximately zero or zero. To exploit the sparsity of multi-path channel (MPC), there are various methods have been proposed. They are, namely, greedy algorithms, iterative algorithms, and convex program. The former two algorithms are easy to be implemented but not stable; on the other hand, the last method is stable but difficult to be implemented as practical channel estimation problems because of computational complexity. In this paper, we proposed a novel channel estimation strategy by using modified smoothed (MSL0) algorithm which combines stable and low complexity. Computer simulations confirm the effectiveness of the introduced algorithm comparisons with the existing methods. We also give various simulations to verify the sensing training signal method. 0 KeywordsSmooth L0 Algorithm, Phase Transition, Sparse Channel Estimation, Compressive Sensing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Binary Compressive Sensing via \ell_0 Gradient Descent

We present a fast Compressive Sensing algorithm for the reconstruction of binary signals {0, 1}-valued binary signals from its linear measurements. The proposed algorithm minimizes a non-convex penalty function that is given by a weighted sum of smoothed l0 norms, under the [0, 1] box-constraint. It is experimentally shown that the proposed algorithm is not only significantly faster than linear...

متن کامل

Least Mean Square Algorithm with Application to Improved Adaptive Sparse Channel Estimation

Least mean square (LMS) based adaptive algorithms have been attracted much attention since their low computational complexity and robust recovery capability. To exploit the channel sparsity, LMS-based adaptive sparse channel estimation methods, e.g., L1-norm LMS or zero-attracting LMS (sparse LMS or ZA-LMS), reweighted zero attracting LMS (RZA-LMS) and Lp-norm LMS (LP-LMS), have been proposed b...

متن کامل

Performance Analysis of Stap Algorithms Based on Fast Sparse Recovery Techniques

In the field of space-time adaptive processing (STAP), spare recovery type STAP (SR-STAP) algorithms exploit formulation of the clutter estimation problem in terms of sparse representation of a small number of clutter positions among a much larger number of potential positions in the angle-Doppler plane, and provide an effective approach to suppress the clutter especially in very short snapshot...

متن کامل

Joint Smoothed l0-Norm DOA Estimation Algorithm for Multiple Measurement Vectors in MIMO Radar

Direction-of-arrival (DOA) estimation is usually confronted with a multiple measurement vector (MMV) case. In this paper, a novel fast sparse DOA estimation algorithm, named the joint smoothed l 0 -norm algorithm, is proposed for multiple measurement vectors in multiple-input multiple-output (MIMO) radar. To eliminate the white or colored Gaussian noises, the new method first obtains a low-comp...

متن کامل

A Modified Adaptive Sparse Channel Estimator for OFDM Systems Based On Singular Value Decomposition

In this paper, a modified adaptive sparse channel estimator based on singular value decomposition (SVD) for OFDM systems is proposed. The conventional adaptive sparsity matching pursuit (ASMP) based compressive channel estimation has bad anti-noise performance, although not needing the information of sparsity. Because using the SVD to modify the measurement matrix of CS can improve the robustne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1005.2267  شماره 

صفحات  -

تاریخ انتشار 2010